/**
 * 给1000个点求最长点对，直接枚举即可
 */
#include <bits/stdc++.h>
using namespace std;

using llt = long long;
struct _t{
    llt x;
    llt y;
};

int N;
vector<_t> A;

int dist(int i, int j){
    auto x = A[i].x - A[j].x;
    auto y = A[i].y - A[j].y;
    return x * x + y * y;
}

void work(){
    cin >> N;
    A.assign(N, {});
    for(auto & i : A) cin >> i.x >> i.y;

    int a = 0, b = 1;
    auto ans = dist(a, b);
    for(int i=0;i<N;++i)for(int j=i+1;j<N;++j){
        auto t = dist(i, j);
        if(ans < t){
            ans = t;
            a = i, b = j;
        }
    }
    cout << A[a].x << " " << A[a].y << " " << A[b].x << " " << A[b].y << endl;
    return;
}

int main(){
#ifndef ONLINE_JUDGE
    freopen("z.txt", "r", stdin);
#endif
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);	
    int nofkase = 1;
    // cin >> nofkase;
    while(nofkase--) work();
	return 0;
}